Spectral Embedding Norm: Looking Deep into the Spectrum of the Graph Laplacian
نویسندگان
چکیده
منابع مشابه
Low-Norm Graph Embedding
Learning distributed representations for nodes in graphs has become an important problem that underpins a wide spectrum of applications. Existing methods to this problem learn representations by optimizing a softmax objective while constraining the dimension of embedding vectors. We argue that the generalization performance of these methods are probably not due to the dimensionality constraint ...
متن کاملThe Laplacian spectrum of a mixed graph
In this paper, we discuss some properties of relations between a mixed graph and its line graph, which are used to characterize the Laplacian spectrum of a mixed graph. Then we present two sharp upper bounds for the Laplacian spectral radius of a mixed graph in terms of the degrees and the average 2-degrees of vertices and we also determine some extreme graphs which attain these upper bounds. ©...
متن کاملSpectral Results for the Graph Laplacian
In this paper, we consider the Laplacian Operator on graphs, along with its eigenvectors and eigenvalues. After establishing preliminaries, we give eigenvector expansions for solutions of Electrical Network Boundary Value Problems. We then state some results for the nodal domains of our eigenvectors.
متن کاملOn the spectrum of the normalized graph Laplacian
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this spectrum under local and global operations like motif doubling, graph joining or splitting. The eigenvalue 1 plays a particular role, and we therefore emphasize tho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Imaging Sciences
سال: 2020
ISSN: 1936-4954
DOI: 10.1137/18m1283160